Fully Dynamic Orthogonal Range Reporting on RAM
نویسنده
چکیده
منابع مشابه
Amortized Bounds for Dynamic Orthogonal Range Reporting
We consider the fundamental problem of 2-D dynamic orthogonal range reporting for 2and 3-sided queries in the standard word RAM model. While many previous dynamic data structures use O(log n/ log log n) update time, we achieve faster O(log n) and O(log n) update times for 2and 3-sided queries, respectively. Our data structures have optimalO(log n/ log log n) query time. Only Mortensen [13] had ...
متن کاملDynamic Data Structures: Orthogonal Range Queries and Update Efficiency
English) We study dynamic data structures for different variants of orthogonal range reporting query problems. In particular, we consider (1) the planar orthogonal 3-sided range reporting problem: given a set of points in the plane, report the points that lie within a given 3-sided rectangle with one unbounded side, (2) the planar orthogonal range maxima reporting problem: given a set of points...
متن کاملDynamic Orthogonal Range Searching on the RAM, Revisited
We study a longstanding problem in computational geometry: 2-d dynamic orthogonal range reporting. We present a new data structure achieving O ( logn log logn + k ) optimal query time and O ( log2/3+o(1) n ) update time (amortized) in the word RAM model, where n is the number of data points and k is the output size. This is the first improvement in over 10 years of Mortensen’s previous result [...
متن کاملTowards Tight Lower Bounds for Range Reporting on the RAM
In the orthogonal range reporting problem, we are to preprocess a set of n points with integer coordinates on a U ×U grid. The goal is to support reporting all k points inside an axis-aligned query rectangle. This is one of the most fundamental data structure problems in databases and computational geometry. Despite the importance of the problem its complexity remains unresolved in the word-RAM...
متن کاملConcurrent Range Reporting in Two-Dimensional Space
In the concurrent range reporting (CRR) problem, the input is L disjoint sets S1, ..., SL of points in R d with a total of N points. The goal is to preprocess the sets into a structure such that, given a query range r and an arbitrary set Q ⊆ {1, ..., L}, we can efficiently report all the points in Si ∩ r for each i ∈ Q. The problem was studied as early as 1986 by Chazelle and Guibas [9] and ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 35 شماره
صفحات -
تاریخ انتشار 2006